On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
نویسندگان
چکیده
The introduction of a non-black-box simulation technique by Barak (FOCS 2001) has been a major landmark in cryptography, breaking the previous barriers of black-box impossibility. Barak’s technique has given rise to various powerful applications and it is a key component in all known protocols with non-black-box simulation. We present the first non-black-box simulation technique that does not rely on Barak’s technique (or on nonstandard assumptions). Invoking this technique, we obtain new and improved protocols resilient to various resetting attacks. These improvements include weaker computational assumptions and better round complexity. A prominent feature of our technique is its compatibility with rewinding techniques from classic black-box zero-knowledge protocols. The combination of rewinding with non-black-box simulation has proven instrumental in coping with challenging goals as: simultaneously-resettable zero-knowledge, proofs of knowledge, and resettablesecurity from one-way functions. While previous works required tailored modifications to Barak’s technique, we give a general recipe for combining our technique with rewinding. This yields simplified resettable protocols in the above settings, as well as improvements in round complexity and required computational assumptions. The main ingredient in our technique is a new impossibility result for general program obfuscation. The results extend the impossibility result of Barak et al. (CRYPTO 2001) to the case of obfuscation with approximate functionality; thus, settling a question left open by Barak et al.. In the converse direction, we show a generic transformation from any resettably-sound zero-knowledge protocol to a family of functions that cannot be obfuscated. ∗This paper is the full version of extended abstracts that appeared in FOCS 2012 [9] and STOC 2013 [10] †MIT. Email: [email protected]. This research was done while the first Author was at Tel Aviv University and supported by the Check Point Institute for Information Security, an ISF grant 20006317, the Fulbright program, and an IBM Ph.D. fellowship. Part of this research was done while visiting Boston University and IBM T. J. Watson Research Center. ‡Boston University. Email: [email protected]. Supported by the Simons award for graduate students in theoretical computer science and NSF award 1218461.
منابع مشابه
The impossibility of obfuscation with a universal simulator
We show that indistinguishability obfuscation implies that all functions with sufficient “pseudoentropy” cannot be obfuscated under a virtual black box definition with a universal simulator. Let F = {fs} be a circuit family with super-polynomial pseudo-entropy, and suppose O is a candidate obfuscator with universal simulator S. We demonstrate the existence of an adversary A that, given the obfu...
متن کاملObfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
We show the following result: Assuming the existence of public-coin differing-input obfuscation (pc-diO) for the class of all polynomial time Turing machines, then there exists a four message, fully concurrent zero-knowledge proof system for all languages in NP with negligible soundness error. This result is constructive: given pc-diO, our reduction yields an explicit protocol along with an exp...
متن کاملThe Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
In this paper we show that the existence of general indistinguishability obfuscators conjectured in a few recent works implies, somewhat counterintuitively, strong impossibility results for virtual black box obfuscation. In particular, we show that indistinguishability obfuscation for all circuits implies: • The impossibility of average-case virtual black box obfuscation with auxiliary input fo...
متن کاملMore on Impossibility of Virtual Black-Box Obfuscation in Idealized Models
The celebrated work of Barak et al. (Crypto’01) ruled out the possibility of virtual blackbox (VBB) obfuscation for general circuits. The recent work of Canetti, Kalai, and Paneth (TCC’15) extended this impossibility to the random oracle model as well assuming the existence of trapdoor permutations (TDPs). On the other hand, the works of Barak et al. (Crypto’14) and Brakerski-Rothblum (TCC’14) ...
متن کاملOn the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
The celebrated work of Barak et al. (Crypto’01) ruled out the possibility of virtual blackbox (VBB) obfuscation for general circuits. The recent work of Canetti, Kalai, and Paneth (TCC’15) extended this impossibility to the random oracle model as well assuming the existence of trapdoor permutations (TDPs). On the other hand, the works of Barak et al. (Crypto’14) and Brakerski-Rothblum (TCC’14) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 44 شماره
صفحات -
تاریخ انتشار 2015